Truth even unto its innermost parts

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Finding truth even if the crowd is wrong

Over a hundred years ago Galton reported on the uncanny accuracy of the median estimate of the weight of an ox, as judged by spectators at a country fair [1]. Since then, the notion that the ‘wisdom of the crowd’ is superior to any individual has itself become a piece of crowd wisdom, raising expectations that web-based opinion aggregation might replace expert judgment as a source of policy gui...

متن کامل

Arithmetic properties of partitions with even parts distinct

In this work, we consider the function ped(n), the number of partitions of an integer n wherein the even parts are distinct (and the odd parts are unrestricted). Our goal is to consider this function from an arithmetical point of view in the spirit of Ramanujan’s congruences for the unrestricted partition function p(n). We prove a number of results for ped(n) including the following: For all n≥...

متن کامل

Proving Innermost Normalisation Automatically

We present a technique to prove innermost normalisation of term rewriting systems (TRSs) automatically. In contrast to previous methods, our technique is able to prove innermost normalisation of TRSs that are not terminating. Our technique can also be used for termination proofs of all TRSs where innermost normalisation implies termination, such as non-overlapping TRSs or locally con uent overl...

متن کامل

Orderings for Innermost Termination

This paper shows that the suitable orderings for proving innermost termination are characterized by the innermost parallel monotonicity , IP-monotonicity for short. This property may lead to several innermost-specific orderings. Here, an IP-monotonic version of the Recursive Path Ordering is presented. This variant can be used (directly or as ingredient of the Dependency Pairs method) for provi...

متن کامل

Deciding Innermost Loops

We present the first method to disprove innermost termination of term rewrite systems automatically. To this end, we first develop a suitable notion of an innermost loop. Second, we show how to detect innermost loops: One can start with any technique amenable to find loops. Then our novel procedure can be applied to decide whether a given loop is an innermost loop. We implemented and successful...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: eLife

سال: 2021

ISSN: 2050-084X

DOI: 10.7554/elife.66850